The geometry of covering codes: small complete caps and saturating sets in Galois spaces

نویسنده

  • Massimo Giulietti
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal 1-saturating sets and complete caps in binary projective spaces

In binary projective spaces PG(v, 2), minimal 1-saturating sets, including sets with inner lines and complete caps, are considered. A number of constructions of the minimal 1-saturating sets are described. They give infinite families of sets with inner lines and complete caps in spaces with increasing dimension. Some constructions produce sets with an interesting symmetrical structure connected...

متن کامل

Galois geometries and coding theory

Galois geometries and coding theory are two research areas which have been interacting with each other for many decades. From the early examples linking linear MDS codes with arcs in finite projective spaces, linear codes meeting the Griesmer bound with minihypers, covering radius with saturating sets, links have evolved to functional codes, generalized projective Reed–Muller codes, and even fu...

متن کامل

Linear nonbinary covering codes and saturating sets in projective spaces

Let AR,q denote a family of covering codes, in which the covering radius R and the size q of the underlying Galois field are fixed, while the code length tends to infinity. The construction of families with small asymptotic covering densities is a classical problem in the area Covering Codes. In this paper, infinite sets of families AR,q, where R is fixed but q ranges over an infinite set of pr...

متن کامل

Small complete caps in Galois affine spaces

Some new families of caps in Galois affine spaces AG(N , q) of dimension N ≡ 0 (mod 4) and odd order q are constructed. Such caps are proven to be complete by using some new ideas depending on the concept of a regular point with respect to a complete plane arc. As a corollary, an improvement on the currently known upper bounds on the size of the smallest complete caps in AG(N , q) is obtained.

متن کامل

Linear covering codes over nonbinary finite fields

For a prime power q and for integers R, η with R > 0, 0 ≤ η ≤ R − 1, let A R,q = (Cni)i denote an infinite sequence of q-ary linear [ni, ni − ri]qR codes Cni with covering radius R and such that the following two properties hold: (a) the codimension ri = Rti + η, where (ti)i is an increasing sequence of integers; (b) the length ni of Ci coincides with f (η) q (ri), where f (η) q is an increasin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013